A polynomial-time algorithm for the change-making problem
نویسندگان
چکیده
منابع مشابه
A polynomial-time algorithm for the change-making problem
The change-making problem is the problem of representing a given value with the fewest coins possible from a given set of coin denominations. To solve this problem for arbitrary coin systems is NP-hard L]. We investigate the problem of determining whether the greedy algorithm always produces the optimal result for a given coin system. Chang and Gill CG] show that this can be solved in time poly...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA simple, polynomial-time algorithm for the matrix torsion problem
The Matrix Torsion Problem (MTP) is: given a square matrix M with rational entries, decide whether two distinct powers of M are equal. It has been shown by Cassaigne and the author that the MTP reduces to the Matrix Power Problem (MPP) in polynomial time [1]: given two square matrices A and B with rational entries, the MTP is to decide whether B is a power of A. Since the MPP is decidable in po...
متن کاملA Polynomial-time Exact Algorithm for the Subset Sum Problem
Subset sum problem, (SSP), is an important problem in complexity theory, it belongs to complexity class NP-Hard, therefore to find a polynomial-time exact algorithm that solves subset sum problem proves that P=NP. In the present paper it will be shown a theorem that allows us to develop, as described in the paper, an algorithm of polynomial-time complexity. For a deepening on complexity theory ...
متن کاملA Polynomial Time Algorithm for The Traveling Salesman Problem
The ATSP polytope can be expressed by asymmetric polynomial size linear program. Introduction In his seminal work [1], M. Yannakakis proved that the Traveling Salesman problem (TSP) polytope cannot be expressed by symmetric polynomial size linear program, where symmetry means that the polytope is an invariant under vertex relabeling. The question about the size of asymmetric linear programs was...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2005
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.06.001